Off-line compression by greedy textual substitution

Compression of Biological Sequences by Greedy Off-Line Textual Substitution

Compression of Biological Sequences by Greedy Off-Line Textual Subsitution

Some Theory and Practice of Greedy Off-Line Textual Substitution

Greedy off-line textual substitution refers to the following approach to compression or structural inference. Given a long textring x, a substring w is identified such that replacing all Instances of w in x except one by a suitable pair of pointers yields the highest possible contraction of Xi the process is then repeated on the contracted textstring, until substrings capable of producing contr...

Linear-Time Off-Line Text Compression by Longest-First Substitution

Given a text, grammar-based compression is to construct a grammar that generates the text. There are many kinds of text compression techniques of this type. Each compression scheme is categorized as being either off-line or on-line, according to how a text is processed. One representative tactics for off-line compression is to substitute the longest repeated factors of a text with a production ...

Image Compression via Textual Substitution

Textual substitution methods, often called dictionary methods or Lempel-Ziv methods, after the important work of Lempel and Ziv, are one-dimensional compression methods that maintain a constantly changing dictionary of strings to adaptively compress a stream of characters by replacing common substrings with indices (pointers) into a dictionary. Lempel and Ziv proved that the proposed schemes we...